Wireless indoor network planning for advanced exposure and installation cost minimization
نویسندگان
چکیده
منابع مشابه
Exposure Optimization in Indoor Wireless Networks by Heuristic Network Planning
Due to the increased use of indoor wireless networks and the concern about human exposure to radio-frequency sources, exposure awareness has increased during recent years. However, current-day network planners rarely take into account electric-field strengths when designing networks. Therefore, in this paper, a heuristic indoor network planner for exposure calculation and optimization of wirele...
متن کاملPlanning system for indoor wireless network
A novel Wireless LAN prediction tool using genetic algorithm and neural network has been proposed in this paper. We establish a site survey tool system to predict the Received Signal Strength Index (RSSI) in indoor environment. The system includes six items. (1) The fading function: It corrects the functional characteristics of the RSSI for different kinds of Wireless LAN card in free space. (2...
متن کاملJoint Minimization of Uplink and Downlink Whole-Body Exposure Dose in Indoor Wireless Networks
The total whole-body exposure dose in indoor wireless networks is minimized. For the first time, indoor wireless networks are designed and simulated for a minimal exposure dose, where both uplink and downlink are considered. The impact of the minimization is numerically assessed for four scenarios: two WiFi configurations with different throughputs, a Universal Mobile Telecommunications System ...
متن کاملEnergy Minimization for Heterogeneous Wireless Sensor Network
Lifetime is very important to wireless sensor networks since most sensors are equipped with non-rechargeable batteries. Therefore, energy and delay are critical issues for the research of sensor networks. that have limited lifetime. Due to the uncertainties in execution time of some tasks, this paper models each varied execution time as a probabilistic random variable with the consideration of ...
متن کاملMinimum cost capacity installation for multicommodity network flows
Consider a directed graph G = (V; A), and a set of traac demands to be shipped between pairs of nodes in V. Capacity has to be installed on the edges of this graph (in integer multiples of a base unit) so that traac can be routed. In this paper we consider the problem of minimum cost installation of capacity on the arcs to ensure that the required demands can be shipped simultaneously between n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURASIP Journal on Wireless Communications and Networking
سال: 2015
ISSN: 1687-1499
DOI: 10.1186/s13638-015-0425-z